On polynomial and barycentric interpolations
نویسندگان
چکیده
The present survey collects some recent results on barycentric interpolation showing the similarity to the corresponding Lagrange (or polynomial) theorems. Namely we state that the order of the Lebesgue constant for barycentric interpolation is at least log n; we state a Grünwald–Marcinkiewicz type theorem for the barycentric case; moreover we define a Bernstein type process for the barycentric interpolation which is convergent for any continuous function. As far as we know this is the first process of this type. The analogue results for the polynomial Lagrange interpolation are well known.
منابع مشابه
The numerical stability of barycentric Lagrange interpolation
The Lagrange representation of the interpolating polynomial can be rewritten in two more computationally attractive forms: a modified Lagrange form and a barycentric form. We give an error analysis of the evaluation of the interpolating polynomial using these two forms. The modified Lagrange formula is shown to be backward stable. The barycentric formula has a less favourable error analysis, bu...
متن کاملBarycentric Lagrange Interpolation
Barycentric interpolation is a variant of Lagrange polynomial interpolation that is fast and stable. It deserves to be known as the standard method of polynomial interpolation.
متن کاملExplicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
Barycentric interpolation is arguably the method of choice for numerical polynomial interpolation. The polynomial interpolant is expressed in terms of function values using the so-called barycentric weights, which depend on the interpolation points. Few explicit formulae for these barycentric weights are known. In [H. Wang and S. Xiang, Math. Comp., 81 (2012), 861–877], the authors have shown t...
متن کاملBarycentric-Remez algorithms for best polynomial approximation in the chebfun system
Variants of the Remez algorithm for best polynomial approximation are presented based on two key features: the use of the barycentric interpolation formula to represent the trial polynomials, and the setting of the whole computation in the chebfun system, where the determination of local and global extrema at each iterative step becomes trivial. The new algorithms make it a routine matter to co...
متن کاملOn a pointwise convergence of trigonometric interpolations with shifted nodes
We consider trigonometric interpolations with shifted equidistant nodes and investigate their accuracies depending on the shift parameter. Two different types of interpolations are in the focus of our attention: the Krylov-Lanczos and the rational-trigonometric-polynomial interpolations. In both cases, we find optimal shifts that provide with the best accuracy in different frameworks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015